package com.berchen.数据结构.二叉树;

/**
 * 二叉树的排序的测试
 */
public class BinaryTreeOrderTest {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        TreeNode root=new TreeNode(1,"chen1");
        TreeNode node2=new TreeNode(2,"chen2");
        TreeNode node3=new TreeNode(3,"chen2");
        TreeNode node4=new TreeNode(4,"chen2");
        TreeNode node5=new TreeNode(5,"chen2");

        root.left=node2;
        root.right=node3;
        node3.right=node4;
        node3.left=node5;
        binaryTree.root=root;

        binaryTree.preOrder(root);
        binaryTree.innOrder(root);
    }
}
